A compact routing scheme for power-law networks using empirical discoveries in power-law graph topology

The Internet is unique. It is the most complex quasi-physical entity created by humans: we can’t completely model it, and we don’t fully understand its structure or its growth patterns [21]. As a result, hot research topics in the past several years include the empirical study of Internet topology, the construction of mathematical models of “Internet-like” topology [20, 1], problems in network growth and evolution [2] and problems in network routing [25, 4, 17]. We propose a new compact routing scheme which builds on previous work in compact routing and Internet-like graph topology, augmented by empirical results on graph topology obtained using a new dynamic graph simulator.